GA Project: Operators for the Travelling Salesman Problem
نویسنده
چکیده
The purpose of this paper is to discuss the implementation and performance of two genetic operators specifically tuned to solve the Travelling Salesman Problem. The two operators discussed are the Greedy Knot-Cracker crossover operator and a modified version of the 3-opt mutation operator. Specifically the paper shall discuss the motivation for choosing these operators, their implementation, their application to a number of standard benchmark problems, and how they compare to a different set of operators (Alternating Edges crossover & reciprocal swap mutation).
منابع مشابه
AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملExploration of Genetic Parameters and Operators through Travelling Salesman Problem
In this paper, we describe the use of advanced statistical design in the screening experiment to configure parameters and operators of genetic algorithm (GA), which applied to find a shortest distance in a classical travelling salesman problem (TSP). Due to the number of GA parameters, operators and its levels considered in the experiment, the total numbers of program executions required by the...
متن کاملStudy of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators. In this paper, we state implementation of some recent TSP solver crossovers at first and then we use each of ...
متن کامل